228 research outputs found
Multi-contact Walking Pattern Generation based on Model Preview Control of 3D COM Accelerations
We present a multi-contact walking pattern generator based on preview-control
of the 3D acceleration of the center of mass (COM). A key point in the design
of our algorithm is the calculation of contact-stability constraints. Thanks to
a mathematical observation on the algebraic nature of the frictional wrench
cone, we show that the 3D volume of feasible COM accelerations is a always a
downward-pointing cone. We reduce its computation to a convex hull of (dual) 2D
points, for which optimal O(n log n) algorithms are readily available. This
reformulation brings a significant speedup compared to previous methods, which
allows us to compute time-varying contact-stability criteria fast enough for
the control loop. Next, we propose a conservative trajectory-wide
contact-stability criterion, which can be derived from COM-acceleration volumes
at marginal cost and directly applied in a model-predictive controller. We
finally implement this pipeline and exemplify it with the HRP-4 humanoid model
in multi-contact dynamically walking scenarios
Stability of Surface Contacts for Humanoid Robots: Closed-Form Formulae of the Contact Wrench Cone for Rectangular Support Areas
Humanoid robots locomote by making and breaking contacts with their
environment. A crucial problem is therefore to find precise criteria for a
given contact to remain stable or to break. For rigid surface contacts, the
most general criterion is the Contact Wrench Condition (CWC). To check whether
a motion satisfies the CWC, existing approaches take into account a large
number of individual contact forces (for instance, one at each vertex of the
support polygon), which is computationally costly and prevents the use of
efficient inverse-dynamics methods. Here we argue that the CWC can be
explicitly computed without reference to individual contact forces, and give
closed-form formulae in the case of rectangular surfaces -- which is of
practical importance. It turns out that these formulae simply and naturally
express three conditions: (i) Coulomb friction on the resultant force, (ii) ZMP
inside the support area, and (iii) bounds on the yaw torque. Conditions (i) and
(ii) are already known, but condition (iii) is, to the best of our knowledge,
novel. It is also of particular interest for biped locomotion, where undesired
foot yaw rotations are a known issue. We also show that our formulae yield
simpler and faster computations than existing approaches for humanoid motions
in single support, and demonstrate their consistency in the OpenHRP simulator.Comment: 14 pages, 4 figure
Completeness of Randomized Kinodynamic Planners with State-based Steering
Probabilistic completeness is an important property in motion planning.
Although it has been established with clear assumptions for geometric planners,
the panorama of completeness results for kinodynamic planners is still
incomplete, as most existing proofs rely on strong assumptions that are
difficult, if not impossible, to verify on practical systems. In this paper, we
focus on an important class of kinodynamic planners, namely those that
interpolate trajectories in the state space. We provide a proof of
probabilistic completeness for these planners under assumptions that can be
readily verified from the system's equations of motion and the user-defined
interpolation function. Our proof relies crucially on a property of
interpolated trajectories, termed second-order continuity (SOC), which we show
is tightly related to the ability of a planner to benefit from denser sampling.
We analyze the impact of this property in simulations on a low-torque pendulum.
Our results show that a simple RRT using a second-order continuous
interpolation swiftly finds solution, while it is impossible for the same
planner using standard Bezier curves (which are not SOC) to find any solution.Comment: 21 pages, 5 figure
- …